On words containing all short subwords
نویسندگان
چکیده
منابع مشابه
Words Avoiding Reversed Subwords
We examine words w satisfying the following property: if x is a subword of w and |x| is at least k for some fixed k, then the reversal of x is not a subword of w.
متن کاملPeriodic Subwords in 2-piece Words
We find families of words W where W is a product of k pieces for k=2. For k=3,4,6, W arises in a small cancellation group with single defining relation W=1. We assume W involves generators but not their inverses and does not have a periodic cyclic permutation (like XY...XYX for nonempty base word XY). We prove W or W written backwards equals ABCD where ABC, CDA are periodic words with base word...
متن کاملSeparability by Short Subsequences and Subwords
The separability problem for regular languages asks, given two regular languages I and E, whether there exists a language S that separates the two, that is, includes I but contains nothing from E. Typically, S comes from a simple, less expressive class of languages than I and E. In general, a simple separator S can be seen as an approximation of I or as an explanation of how I and E are differe...
متن کاملShort strings containing all k-element permutations
We consider the problem of finding short strings that contain all permutations of order k over an alphabet of size n, with k ≤ n. We show constructively that k(n− 2) + 3 is an upper bound on the length of shortest such strings, for n ≥ k ≥ 10. Consequently, for n ≥ 10, the shortest strings that contain all permutations of order n have length at most n− 2n+ 3. These two new upper bounds improve ...
متن کاملOn the number of occurrences of all short factors in almost all words
We previously proved that almost all words of length n over a finite alphabet A with m letters contain as factors all words of length k(n) over A as n → ∞, provided lim supn→∞ k(n)/ log n < 1/ log m. In this note it is shown that if this condition holds, then the number of occurrences of any word of length k(n) as a factor into almost all words of length n is at least s(n), where limn→∞ log s(n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00231-4